101![Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one](https://www.pdfsearch.io/img/0dd77260be763b2ec4918cef850eee49.jpg) | Add to Reading ListSource URL: www2.informatik.hu-berlin.deLanguage: English - Date: 2014-06-25 03:14:23
|
---|
102![Relativizing Small Complexity Classes and their Theories Klaus Aehlig∗ Stephen Cook Relativizing Small Complexity Classes and their Theories Klaus Aehlig∗ Stephen Cook](https://www.pdfsearch.io/img/1b32db590e5744f0a9a2aaa7911dd45e.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2007-10-18 18:16:58
|
---|
103![Downloaded from rsif.royalsocietypublishing.org on June 10, 2010 The evolvability of programmable hardware Karthik Raman and Andreas Wagner J. R. Soc. Interface published online 9 June 2010 doi: rsif Downloaded from rsif.royalsocietypublishing.org on June 10, 2010 The evolvability of programmable hardware Karthik Raman and Andreas Wagner J. R. Soc. Interface published online 9 June 2010 doi: rsif](https://www.pdfsearch.io/img/743be993d10d1167b5d7c10276f87568.jpg) | Add to Reading ListSource URL: www.ieu.uzh.chLanguage: English - Date: 2015-12-07 07:40:36
|
---|
104![Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture](https://www.pdfsearch.io/img/f170d73a6f070ef976b87deeb878a546.jpg) | Add to Reading ListSource URL: www.usenix.orgLanguage: English |
---|
105![Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , , Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,](https://www.pdfsearch.io/img/9907a2c994fdfe994491d0ca48818426.jpg) | Add to Reading ListSource URL: yices.csl.sri.comLanguage: English - Date: 2015-12-11 18:43:06
|
---|
106![On the Computational Complexity of ReoptimizationScientific Work On the Computational Complexity of ReoptimizationScientific Work](https://www.pdfsearch.io/img/0b01bbfd858eb60c6cfc83caeba124a6.jpg) | Add to Reading ListSource URL: www.ite.ethz.chLanguage: English - Date: 2008-10-23 07:53:58
|
---|
107![Baire Categories on Small Complexity Classes and Meager-Comeager Laws Philippe Moser Department of Computer Science, National University of Ireland, Maynooth Co. Kildare, Ireland. Baire Categories on Small Complexity Classes and Meager-Comeager Laws Philippe Moser Department of Computer Science, National University of Ireland, Maynooth Co. Kildare, Ireland.](https://www.pdfsearch.io/img/38d2160ab3d394023fdb863820b23ba3.jpg) | Add to Reading ListSource URL: www.cs.nuim.ieLanguage: English - Date: 2007-11-06 08:50:32
|
---|
108![Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch](https://www.pdfsearch.io/img/5944f917ed77e5fc3d2def806b687c26.jpg) | Add to Reading ListSource URL: fc15.ifca.aiLanguage: English - Date: 2015-01-11 00:32:58
|
---|
109![Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu](https://www.pdfsearch.io/img/cf4f3a819a169b4632811130f147e558.jpg) | Add to Reading ListSource URL: www.scottaaronson.comLanguage: English - Date: 2015-06-29 18:20:41
|
---|
110![Controlling Extraction in Abstract Categorial Grammars Sylvain Pogodalla1 and Florent Pompigne2 1 Controlling Extraction in Abstract Categorial Grammars Sylvain Pogodalla1 and Florent Pompigne2 1](https://www.pdfsearch.io/img/192eb54bbbbd6188268b87b543b712fe.jpg) | Add to Reading ListSource URL: www.angl.hu-berlin.deLanguage: English |
---|